Dynamic window sizing in a data network

ABSTRACT

A method for use in a high-speed virtual circuit digital network for resizing windows of virtual circuits in nodes of the network. The resizing of a virtual circuit&#39;s window is initiated by an input router at an edge of the digital network. When the input router determines that resizing is necessary, it sends a first congestion control message to the nodes through which the virtual circuit passes. If the message indicates a larger window, the node receiving the message determines what size window it can provide and sends the message with that window size on to the next node. An output router at the other edge of the digital network receives the message, sets the window size based on the message as altered by the nodes, and returns a second message with the final window size via the nodes. On receipt of the second message, the nodes alter their windows and the input router sends cells as permitted by the new window. Included in the method are novel techniques for determining the ideal window size for a virtual circuit, for determining at the input router when a change in window size is necessary, and for determining the size of the window in the nodes.

CROSS-REFERENCE TO RELATED APPLICATION

The present patent application is a continuation-in-part of U.S. Ser. No. 07/443,975, Hahne, Kalmanek, and Morgan, METHOD AND APPARATUS FOR CONGESTION CONTROL IN A DATA NETWORK, filed Nov. 30, 1989. The present patent application contains the complete Detailed Description and Figures of U.S. Ser. No. 07/443,975. The additional disclosure begins at the section titled "Overview of Window Sizing" and includes two new FIGS. 13 and 14.

TECHNICAL FIELD

The present invention relates to data networks in general and more particularly to protocols, methods and apparatus that improve the flow of information within such networks.

BACKGROUND OF THE INVENTION

Packet-switched networks for the transport of digital data are well known in the prior art. Typically, data are transmitted from a host connecting to a network through a series of network links and switches to a receiving host. Messages from the transmitting host are divided into packets that are transmitted through the network and reassembled at the receiving host. In virtual circuit networks, which are the subject of the present invention, all data packets transmitted during a single session between two hosts follow the same physical network path.

Owing to the random nature of data traffic, data may arrive at a switching node of the network at an instantaneous rate greater than the transmission speed of the outgoing link, and data from some virtual circuits may have to be buffered until they can be transmitted. Various queueing disciplines are known in the prior art. Early data networks typically used some form of first-in-first-out (FIFO) queuing service. In FIFO service, data packets arriving from different virtual circuits are put into a single buffer and transmitted over the output link in the same order in which they arrived at the buffer. More recently, some data networks have used queueing disciplines of round robin type. Such a network is described in a paper by A. G. Fraser entitled, "TOWARDS A UNIVERSAL DATA TRANSPORT SYSTEM," and printed in the IEEE Journal on Selected Areas in Communications, November 1983. Round robin service involves keeping the arriving data on each virtual circuit in a separate per-circuit buffer and transmitting a small amount of data in turn from each buffer that contains any data, until all the buffers are empty. U.S. Pat. No. 4,583,219 to Riddle describes a particular round robin embodiment that gives low delay to messages consisting of a small amount of data. Many other variations also fall within the spirit of round robin service.

First-in-first-out queueing disciplines are somewhat easier to implement than round robin disciplines. However, under heavy-traffic conditions first-in-first-out disciplines can be unfair. This is explained in a paper by S. P. Morgan entitled, "QUEUEING DISCIPLINES AND PASSIVE CONGESTION CONTROL IN BYTE-STREAM NETWORKS," printed in the Proceedings of IEEE INFOCOM, April 1989. When many users are contending for limited transmission resources, first-in-first-out queuing gives essentially all of the bandwidth of congested links to users who submit long messages, to the exclusion of users who are attempting to transmit short messages. When there is not enough bandwidth to go around, round robin disciplines divide the available bandwidth equally among all users, so that light users are not locked out by heavy users.

On any data connection it is necessary to keep the transmitter from overrunning the receiver. For highly bursty data traffic, such as is characteristic of digital data networks, this is commonly done by means of a sliding-window protocol, as described by A. S. Tanenbaum in the book COMPUTER NETWORKS, 2nd ed., published by Prentice Hall (1988), pp. 223-239. The transmitter sends data in units called frames, each of which carries a sequence number. When the receiver has received a frame, it returns the sequence number to the transmitter. The transmitter is permitted to have only a limited number of sequence numbers outstanding at once; that is, it may transmit up to a specified amount of data and then it must wait until it receives the appropriate sequential acknowledgment before transmitting any new data. If an expected acknowledgment does not arrive within a specified time interval, the transmitter retransmits one or more frames. The maximum number of bits that the transmitter is allowed to have in transit at any given time is called the window size and will be denoted here by W. The maximum number of outstanding sequence numbers is also sometimes called the window size, but that usage will not be followed here.

Suppose that the transmitter and receiver are connected by a circuit of speed S bits per second with a round-trip propagation time T₀ seconds, and that they are able to generate or absorb data at a rate not less than S. Let W be the window size. Then, to maintain continuous transmission on an otherwise idle path, W must be at least as large as the round-trip window W₀, where W₀ is given by W₀ =ST₀. W₀ is sometimes called the delay-bandwidth product. If the circuit passes through a number of links whose speeds are different, the S represents the speed of the slowest link. If the window is less than the round-trip window, then the average fraction of the network bandwidth that the circuit gets cannot exceed W/W₀.

In principle, if a circuit has a window of a given size, buffer space adequate to store the entire window must be available at every queueing point to prevent packet loss in all cases, since forward progress can momentarily come to a halt at the beginning of any link. This is explained in more detail below. On a lightly loaded network, significant delays are unlikely and there can generally be sharing of buffer space between circuits. However, the situation is different when the network is congested. Congestion means that too much traffic has entered the network, even though individual circuits may all be flow controlled. Uncontrolled congestion can lead to data loss due to buffer overflow, or to long delays that the sender interprets as losses. The losses trigger retransmissions, which lead to an unstable situation in which network throughput declines as offered load increases. Congestion instability comes about because whenever data has to be retransmitted, the fraction of the network's capacity that was used to transmit the original data has been lost. In extreme cases, a congested network can deadlock and have to be restarted.

Congestion control methods are surveyed by Tanenbaum, op. cit., pp. 287-88 and 309-320. Many congestion control methods involve the statistical sharing of buffer space in conjunction with trying to sense the onset of network congestion. When the onset of congestion is detected, attempts are made to request or require hosts to slow down their input of data into the network. These techniques are particularly the ones that are subject to congestion instability. Abusive hosts may continue to submit data and cause buffer overflow. Buffer overflow causes packet losses not only of a host submitting the packets that cause the overflow, but also of other hosts. Such packet loss then gives rise to retransmission requests from all users losing packets and it is this effect that pushes the network toward instability and deadlock. Alternatively, as mentioned above, it has been recognized for a long time that congestion instability due to data loss does not occur in a virtual-circuit network, provided that a full window of memory is allocated to each virtual circuit at each queueing node, and provided that if a sender times out, it does not retransmit automatically but first issues an inquiry message to determine the last frame correctly received. If full per-circuit buffer allocation is combined with an intrinsically fair queueing discipline, that is, some variant of round robin, the network is stable and as fair as it can be under the given load.

The DATAKIT (Registered trademark) network is a virtual circuit network marketed by AT&T that operates at a relatively low transmission rate and provides full window buffering for every virtual circuit as just described. This network uses technology similar to that disclosed in U.S. Pat. Re 31,319, which reissued on Jul. 19, 1983 from A. G. Fraser's U.S. Pat. No. 3,749,845 of Jul. 31, 1973, and operates over relatively low-speed T1 channels at approximately 1.5 megabits per second. The DATAKIT network is not subject to network instability because of full-window buffering for each virtual circuit and because data loss of one host does not cause data loss of other users. Dedicated full-window buffering is reasonable for such low-speed channels; however, the size of a data window increases dramatically at speeds higher than 1.5 megabits per second, such as might be used in fiber-optic transmission. If N denotes the maximum number of simultaneously active virtual circuits at a node, the total buffer space that is required to provide a round-trip window for each circuit is NST₀. It may be practicable to supply this amount of memory at each node of a low-speed network of limited geographical extent. However, at higher speeds and network sizes, it ultimately ceases to be feasible to dedicate a full round-trip window of memory for every virtual circuit. For example, assuming a nominal transcontinental packet round-trip propagation time of 60 ms, a buffer memory of 11 kilobytes is required for every circuit at every switching node for a 1.5 megabits per second transmission rate. This increases to 338 kilobytes at a 45 megabits per second rate.

A need exists for solutions to the problem of avoiding congestion instability, while at the same avoiding the burgeoning buffer memory requirements of known techniques. It is therefore an overall object of the present invention to retain the advantages of full-window buffering while substantially reducing the total amount of memory required.

It is another object of the invention to reduce the amount of buffering required for each circuit by the sharing of buffer memory between circuits and by dynamic adjustment of window sizes for circuits.

U.S. Pat. No. 4,736,369 to Barzilai et al. addresses some aspects of the problem of adjusting window sizes dynamically during the course of a user session, in response to changes in traffic patterns and buffer availability. However, this patent assumes a network in which flow control and window adjustment are done on a link-by-link basis, that is, as a result of separate negotiations between every pair of adjacent nodes on the path between transmitter and receiver. For high-speed networks, link-by-link flow control is generally considered to be less suitable than end-to-end control, because of the additional computing load that link-by-link control puts on the network nodes.

Thus, it is an another object of the invention to perform flow control on an end-to-end basis with dynamically adjustable windows.

SUMMARY OF THE INVENTION

The invention is a method for controlling the congestion of data cells in a network which has one or more nodes and in which the data cells are transferred across the network via virtual circuits. The steps of the method include: when a virtual circuit is established in the network, assigning an default cell buffer for the virtual circuit at each node; and for the duration of the virtual circuit, performing steps including: determining from the behavior of the virtual circuit whether a different-sized cell buffer is needed; if a different-sized cell buffer is needed, providing a first resizing signal indicating the different size to the nodes in the virtual circuit; in each node of the virtual circuit, responding to the first resizing signal by indicating the buffer size which the node can provide if that is less than the different size; and in each node of the virtual circuit, setting the cell buffer for the virtual circuit to a size no larger than the smallest buffer size indicated by any of the nodes. Other aspects of the invention include a method for determining the cell buffer size, a method for determining the size of the cell buffer to be requested, and a method for determining the size of cell buffer which the node can provide. The methods for determining the cell buffer size and determining the size of the cell buffer which the node can provide involve a constant h, which is derived from the equation

    renegotiation interval=hτ,

where τ is the longest round trip time in the network and the renegotiation interval is an interval of time after which the resizing of the virtual circuit's cell buffer is automatically reconsidered.

BRIEF DESCRIPTION OF THE DRAWING

In the drawing,

FIG. 1 discloses the architecture of a typical data switching network having a plurality of switching nodes connected to user packet host sources and destinations;

FIG. 2 discloses illustrative details of a data receiving and queuing arrangement at a node for an incoming channel having a plurality of multiplexed time slots corresponding to individual virtual circuits;

FIG. 3 discloses illustrative details of a controller of FIG. 2 that administers the buffer space allocation and data queuing of virtual circuits on an incoming channel;

FIG. 4 discloses illustrative details of a router that converts between variable-length data packets from a host and constant-length data cells and further administers the buffer space allocation and data queuing at the router; and

FIG. 5 shows an illustrative method of determining buffer lengths of data for a virtual circuit at a router or switching node;

FIGS. 6 and 7 show illustrative flowcharts depicting the protocols and method steps performed at the routers and nodes of dynamically allocating buffer space for a virtual circuit at routers and nodes for an embodiment in which buffer lengths at input routers are used as decision criteria for dynamic buffer allocation;

FIGS. 8 through 12 disclose flowcharts depicting the protocols and method steps performed at the routers and nodes for allocating buffer space in blocks of fixed or varying sizes to virtual circuits in an embodiment in which buffer lengths at nodes are used in conjunction with buffer lengths at routers as decision criteria;

FIG. 13 shows a congestion control field; and

FIG. 14 is a diagram showing how cell buffer sizes are adjusted in response to a request.

DETAILED DESCRIPTION

FIG. 1 shows a block diagram of an illustrative packet-switching network. It is assumed that the network interconnects many packet sources and destinations by means of virtual circuits among a number of routers and switching nodes. Packet sources and destinations are attached to local area networks that are on user sites. For example, a source 102 is connected to a local network 106, which is connected to a router 110. One of the functions of the router is to convert between the variable-length data packets issued by the source and the constant-length data cells transmitted and switched by the cell network 100. While cells are considered to be of fixed length, this is not a limitation of the invention. Other functions of the router relevant to the invention will be described below.

The router attaches the local network 106 to the cell network 100 via the access line 108. Data cells belonging to a particular virtual circuit are transmitted through a sequence of switching nodes 114 and data links 116 to an access line 118 that is connected to a router 120. The router 120 reassembles the data cells into data packets addressed to a particular destination, and transmits the packets to the local network 124, from whence they are taken by the destination 128.

It is assumed for purposes of disclosure that the network 100 is similar to the DATAKIT (R) virtual circuit network marketed by AT&T, except that the network 100 operates at a considerably higher transmission rate. That is, it is assumed that network 100 establishes a virtual circuit path between a source router and a destination router via selected ones of the switching nodes 114 when a connection is first initiated. Packets passing from a source to a destination are routed via the virtual circuit for the duration of the connection, although the actual transmission lines and bandwidth on the transmission lines in the path are not dedicated to the connection in question, but might be time-shared among many such connections.

In accordance with the invention, FIG. 2 shows an illustrative embodiment of a cell buffering arrangement at a node. This buffering arrangement is able to handle many virtual circuits. Buffer space is allocated per-virtual-circuit and the allocation for a virtual circuit can be changed dynamically, under control of the monitor 200. The monitor is a conventional microprocessor system that is used to implement congestion control mechanisms to be described later. The receiver 202 and transmitter 204 in the figure are conventional, and the transmitter may implement round robin service among the virtual circuits using established techniques.

When a cell arrives, the receiver 202 determines whether the cell is a congestion message as indicated by a bit in the header. Congestion messages are stored in a separate FIFO queue 206 for the monitor. If an arriving cell is not a congestion message, the receiver 202 produces a virtual circuit number on bus WVC and a write request on lead WREQ. The receiver places the cell on its output bus 208 where it is buffered in the cell queue 210 under the control of the controller 212. The cell queue 210 is a memory array of some suitable size, which for the purposes of exposition is organized in words which are one cell wide.

The receiver 202 and the transmitter 204 are autonomous circuits. Each operates independently of the other to enter cells to and remove cells from the cell queue 210, respectively. When the transmitter 204 is ready to send a cell, it produces a virtual circuit number on bus RVC and a read request on lead RREQ. If the allocated buffer in queue 210 associated with virtual circuit RVC is empty, the controller 212 will indicate this condition by setting signal EMPTY to a value of TRUE and the transmitter can try another virtual circuit. Otherwise, the next cell in the buffer associated with RVC will appear on the output bus to be read by the transmitter 204. The controller 212 controls the cell queue via signals on bus MADDR and leads MW and MR. MADDR is the address in the cell queue 210 at which the next cell is to be written or read. MW and MR signify a queue write or read operation, respectively. Congestion messages generated by the monitor 200 are stored in a separate outgoing FIFO 214. These messages are multiplexed with outgoing cells onto the transmission line 216 by the transmitter.

To implement congestion control schemes, the monitor 200 has access to data structures internal to the controller 212 over the buses ADDR, R, W, and DATA. These data structures include the instantaneous buffer length for each virtual circuit and the overall number of cells in the cell queue. Averaging operations required to implement congestion control, according to the protocols described below, are performed by the monitor 200.

FIG. 3 shows illustrative details of the controller 212 of FIG. 2. The major functions of the controller are to keep track of the buffer allocation for each virtual circuit, to keep track of the instantaneous buffer use (buffer length) for each virtual circuit, to manage the allocation of memory in the cell queue such that data can be buffered for each virtual circuit in a dedicated buffer of dynamically varying length, and to control the writing and reading of data in the cell queue as it is received and transmitted. For the purposes of exposition, memory is partitioned in the queue in units of one cell. This section first describes the basic elements of the controller, and then describes the operations of these elements in detail.

An arbiter 300 receives signals WREQ and RREQ, which are requests to write a cell to a buffer associated with a particular virtual circuit or to read a cell from the buffer associated with a particular virtual circuit, respectively. The arbiter insures that read and write operations occur in a non-interfering manner, and that the select input to the multiplexer (W₋₋ OR₋₋ R) is set such that input RVC is present on bus VC during read operations and input WVC is present on bus VC during write operations. The remainder of this discussion will consider read and write operations separately.

A table COUNT₋₋ TABLE 304 is provided for storing the buffer allocation and buffer use for each virtual circuit. The table is addressed with a virtual circuit number on bus VC from the multiplexer 302. Each virtual circuit has two entries in COUNT₋₋ TABLE. One entry, LIMIT[VC], contains the maximum number of cells of data that virtual circuit VC is presently allowed to buffer. This, in turn, determines the window size allocated to the virtual circuit. The second entry, COUNT[VC], contains the number of cells that are presently used in the cell queue 210 by virtual circuit VC. The contents of COUNT₋₋ TABLE can be read or written by the monitor 200 at any time before or during the operation of the controller 212.

A table QUEUE₋₋ POINTERS 306 contains the read and write pointers for the buffer associated with each virtual circuit. Read pointer RP[VC] references the location containing the next cell to be read from the buffer associated with virtual circuit VC; write pointer WP[VC] references the next location to be written in the buffer associated with virtual circuit VC.

Buffers of dynamically varying length are maintained by keeping a linked list of cells for each virtual circuit. The linked lists are maintained by the LIST₋₋ MANAGER 308, which also maintains a linked list of unused cells that make up the free buffer space. Operation of the LIST₋₋ MANAGER is described below.

A GLOBAL₋₋ COUNT register 310 keeps track of the total number of cells in all virtual circuit buffers. If each virtual circuit is initialized with one (unused) cell in its buffer, the initial value of the GLOBAL₋₋ COUNT register is equal to the number of virtual circuits. The GLOBAL₋₋ COUNT register can be written or read by the monitor. The TIMING+CONTROL circuit 312 supplies all of the control signals needed to operate the controller.

Prior to the start of read request or write request operations, the controller is initialized by the monitor. For each virtual circuit, WP[VC] and RP[VC] are initialized with a unique cell number and COUNT[VC] is initialized with a value of 1, representing an empty buffer with one (unused) cell present for receipt of incoming data. The initial value of LIMIT[VC] is the initial buffer allocation for that virtual circuit, which is equivalent to its initial window size. The LIST₋₋ MANAGER is initialized such that the free list is a linked list containing all cells in the cell queue 210 except those which are initialized in table QUEUE₋₋ POINTERS.

When a cell arrives, the receiver asserts a write request on WREQ and the virtual circuit number on WVC. Bus VC is used to address COUNT₋₋ TABLE causing the values in the COUNT[VC] and LIMIT[VC] fields to be sent to a comparator 314. If the virtual circuit in question has not consumed all of its allocated space in the cell queue, i.e. if COUNT[VC] is less than LIMIT[VC] in the table, the comparator will generate a FALSE value on lead LIMITREACHED. Bus VC is also used to address the QUEUE₋₋ POINTERS table such that WP[VC] is present on bus MADDR. When LIMITREACHED is FALSE, the timing and control circuit will generate signal MW which causes the cell to be written to the cell queue 210, and will control the LIST₋₋ MANAGER to cause a new cell to be allocated and linked into the buffer associated with VC. In addition, the buffer use for VC and the overall cell count values will be updated. To update the buffer use, the present value in COUNT[VC] will be routed via bus COUNT to an up/down counter, which increments the present number of cells recorded in COUNT[VC] by one. This new value, appearing on bus NCOUNT, is present at the input of COUNT₋₋ TABLE, and will be written into the table. The overall cell count is incremented in a similar manner using register GLOBAL₋₋ COUNT 310 and an up/down counter 316.

If, during a write operation, LIMITREACHED is TRUE, which means that the virtual circuit in question has consumed all of its allocated space in the cell queue, the T+C circuit 312 will not generate signals to write data into the cell queue, to allocate a new cell, or to increment the value of COUNT[VC] or GLOBAL₋₋ COUNT. Accordingly, any VC exceeding its assigned window size loses the corresponding cells, but the data for other virtual circuits is not affected.

When the transmitter is ready to send a new cell, it asserts a read request on lead RREQ and the virtual circuit number on bus RVC. COUNT₋₋ TABLE is accessed causing the value of COUNT[VC] to be sent to a comparator 318, whose second input is the value zero. If the buffer associated with VC contains no data, the comparator 318 will generate a TRUE signal on EMPTY, and the operation will be terminated by the TIMING+CONTROL circuit 312. If EMPTY is FALSE, the up/down counter 320 will decrement the value of COUNT[VC], and the resulting value will be written into COUNT₋₋ TABLE 304. In this case, the value of RP[VC] from QUEUE₋₋ POINTERS is present on bus MADDR and the MR signal is generated, reading a cell from the cell queue 210. RP[VC] is also input to the LIST₋₋ MANAGER 308 so that the cell can be deallocated and returned to the free store. The address of the next cell in the buffer for VC is present on bus NRP and is written into QUEUE₋₋ POINTERS 306. The overall count of cells buffered, which is stored in GLOBAL₋₋ COUNT 310, is decremented.

The LIST₋₋ MANAGER 308 maintains a linked list of memory locations which make up cell buffers for each virtual circuit. It also maintains a linked list of memory locations which make up the free list. The LIST₋₋ MANAGER 308 contains a link memory LNKMEM 322, which contains one word of information for every cell in the cell queue 210. The width of a word in LNKMEM 322 is the logarithm to base 2 of the number of cells in the cell queue 210. There is a register, FREE 324, which contains a pointer to the first entry in the free list.

Consider the buffer for virtual circuit VC. The read pointer RP[VC] points to a location in the cell buffer at which the next cell for virtual circuit VC is to be read by the transmitter. RP[VC] points to a location in LNKMEM 322 which contains a pointer to the next cell to be read from the cell queue 210 and so on. Proceeding in this manner, one arrives at a location in LNKMEM 322 which points to the same location pointed to by WP[VC]. In the cell queue 210 this location is an unused location which is available for the next cell to arrive for VC.

Free space in the cell queue 210 is tracked in LNKMEM 322 by means of a free list. The beginning of the free list is maintained in a register FREE 324 which points to a location in the cell queue 210 which is not on the buffer for any virtual circuit. FREE points in LNKMEM 322 to a location which contains a pointer to the next free cell, and so on.

When a write request occurs for a virtual circuit VC, if VC has not exceeded its buffer allocation, a new cell will be allocated and linked into the buffer associated with VC. The value in WP[VC] is input to the LIST₋₋ MANAGER 308 on bus WP at the beginning of the operation. A new value NWP of the write pointer is output by the LIST₋₋ MANAGER 308 at the end of the operation. NWP will be written into table QUEUE₋₋ POINTERS 306. This occurs as follows:

1) The value in register FREE 324, which represents an unused cell, will be chained into the linked list associated with VC, and will also be output as NWP.

    NWP=LNKMEM[WP]=FREE

2) The next free location in the free list will be written into FREE 324.

    FREE=LNKMEM[FREE]

When a read request occurs for a virtual circuit VC, the cell which is currently being read, namely RP[VC], will be input to the LIST₋₋ MANAGER 308 on bus RP to be returned to the free list and the next cell in the buffer associated with VC will be returned as NRP. NRP will be written into table QUEUE₋₋ POINTERS 306. This occurs as follows:

1) A new read pointer is returned which points to the next cell in the buffer associated with VC.

    NRP=LNKMEM[RP]

2) The cell which was read in this cycle is deallocated by linking it into the free list.

    LNKMEM[RP]=FREE

    FREE=RP

FIG. 4 is an illustrative embodiment of a router, such as 110 of FIG. 1. Variable length packets arriving from the local area network 106 of FIG. 1 are received by the LAN receiver 400 at the upper left of FIG. 4. A global address, present in each packet, is translated to a virtual circuit number by the translation circuit 402. Since the packet will be transported using fixed length cells that may be smaller or larger than the length of the particular packet under consideration, additional header or trailer bytes may need to be added to the packet to facilitate reassembly of the packet from a sequence of cells which arrive at the destination router, to allow a destination router to exert flow control over a source router, or to allow dropped or misdirected cells to be detected. The resulting information must be padded to a length which is an integral multiple of the cell size. These functions are not pertinent to the invention; however, an illustrative embodiment is described to indicate the relationship of these functions to the congestion management functions that must be performed by the router.

The LAN packet and the virtual circuit number produced by the translation circuit 402 are passed to segmentation circuit 404, which may add header or trailer bytes to the packet, either for the functions described above or as placeholders for such bytes to be supplied by a second segmentation circuit 408. The resulting information is padded to an integral multiple of the cell size and is stored in a cell queue 406, which may be identical in structure to the cell queue 210 described in FIG. 2. In particular, internal data structures in a controller 410 may be accessed by monitor 412 that allow the buffer use (buffer length) to be monitored for each virtual circuit, and that allow the buffer allocation per virtual circuit to be adjusted dynamically. Segmentation circuit 408 performs window flow control on each virtual circuit, where the window size for each virtual circuit may be varied dynamically under the control of the protocols described below. To perform window flow control, segmentation circuit 408 may fill in the added data bytes as appropriate to complete the reassembly and flow control protocol. As a minimum, segmentation circuit 408 maintains a counter per virtual circuit which keeps track of the amount of outstanding, unacknowledged data that it has sent in order to implement window flow control, and it receives acknowledgments from the remote receiver indicating data that has passed safely out of the flow control window. Techniques for implementing reassembly and window flow control are well known in the art; the unique aspect of the invention is that the window sizes and buffer sizes may change dynamically under the influence of congestion control messages. The transmitter 415 takes cells from segmentation circuit 408, from the local receiver as described below, and from the outgoing congestion FIFO 419 and sends them out on the outgoing cell transmission line 416.

Router 110 also receives cells from network 100 via the access line 112 of FIG. 1. These cells arrive at the receiver 414 at the lower right corner of FIG. 4. Insofar as these cells result from packets originated by the source 102 and intended for the destination 128, they will be either congestion messages or acknowledgments from the remote router 120. The handling of cells that may arrive on access line 112 from other sources, which are attempting to communicate with destinations attached to local network 106, will be deferred until the discussion of router 120 below.

When a cell of one of the two types under consideration arrives, the receiver 414 determines whether the cell is a congestion message as indicated by a bit in the header. Congestion messages are stored in a separate FIFO queue 417 for the monitor 412 and handled according to one of the protocols described below. If the protocol generates a further congestion message, an appropriate cell is sent from the monitor 412 to segmentation circuit 408 and multiplexed onto the outgoing cell transmission line 416. If an arriving cell is not a congestion message, the receiver 414 sends the cell to reassembly circuit 418, which determines whether a cell is an acknowledgment from the remote router. If this is the case, reassembly circuit 418 sends an acknowledgment-received notification to segmentation circuit 408, so that it can update the count of the amount of outstanding data.

A router identical in structure with FIG. 4 may also represent element 120 of FIG. 1. In such case, the receiver 414 corresponding to such router takes cells from the outgoing access line 118 of FIG. 1. Insofar as these cells result from packets originated by the source 102 and intended for the destination 128, they will be either data cells or congestion messages from the remote router 110. When a cell arrives, the receiver 414 determines whether the cell is a congestion message as indicated by a bit in the header. Congestion messages are stored in a separate FIFO queue 417 for the monitor 412 and handled according to one of the protocols described below. If the protocol generates a further congestion message, an appropriate cell is sent from the monitor 412 to segmentation circuit 408 and multiplexed onto the outgoing cell transmission line 416 at the lower left of FIG. 4. If an arriving cell is not a congestion message, the receiver 414 sends the cell to reassembly circuit 418, which buffers the arriving cell in a per-virtual circuit buffer in cell queue 420. If the reassembly circuit 418 detects that a complete local area network packet has been accumulated, reassembly circuit 418 sends a send-acknowledgment command to the local transmitter 416 on lead 422, which causes an acknowledgment message to be sent to the remote router 110. In addition, reassembly circuit 418 issues multiple-read requests to the buffer controller 422 causing the cells which make up the packet to be sent in succession to reassembly circuit 424. To facilitate the reassembly procedure, reassembly circuit 424 may delete any header or trailer bytes which were added when the packet was converted to cells by router 110. The packet is then sent to the translation circuit 426, where the global address is translated into a local area network specific address before the packet is sent onto the local area network 124.

Choice of Window Sizes

The operation of the apparatus and protocols described in this invention does not depend on the choice of window sizes. Various practical considerations may determine the window sizes that are used. If there are only two window sizes, the following considerations lead to preferred relationships among the numbers of virtual circuits and the window sizes.

Suppose that the maximum number of virtual circuits that can be simultaneously active at a given node is N₀. Suppose further that it is decided to provide some number N₁ less than N₀ of the virtual circuits with full-size windows W₀, while providing the remaining N₀ -N₁ virtual circuits with buffers of some smaller size B₀ that is adequate for light traffic. If there are N₁ simultaneous users each of whom gets an equal fraction of the channel, the fraction of the channel that each gets is 1/N₁. The maximum fraction of the channel capacity that can be obtained by a user having a window size B₀ is B₀ /W₀. Setting 1/N₁ equal to the maximum fraction of the trunk that can be had by a user with a small buffer, namely B₀ /W₀, gives the following relationship among the quantities: W₀ /B₀ =N₁. The total buffer space B allocated to all the virtual circuits is

    B=(N.sub.0 -N.sub.1)B.sub.0 +N.sub.1 W.sub.0 =N.sub.0 B.sub.0 -W.sub.0 +W.sub.0.sup.2 /B.sub.0.

Minimizing B with respect to B₀ leads to

    B.sub.0 =W.sub.0 /(N.sub.0).sup.1/2,

    N.sub.1 =(N.sub.0).sup.1/2,

    B=[2(N.sub.0).sup.1/2 -1]W.sub.0.

These equations provide preferred relationships among B₀, N₁, N₀, and W₀.

If there are more than two window sizes, various choices are possible. It may be convenient to choose the sizes in geometric progression, for example, increasing by powers of 2. An alternative approach that may be preferred in some instances is to have different sizes correspond to round-trip windows at various standard transmission speeds. Still other choices may be dictated by other circumstances.

Buffer Allocation Protocols

The following discusses protocols by means of which sharable buffer space is allocated and deallocated and by means of which virtual-circuit nodes, routers, and hosts are so alerted. The reader is directed to FIG. 5 through 12 as required.

Each node controller 212 keeps track of the buffer length of each of its virtual circuits via the entry COUNT[VC] in the table COUNT₋₋ TABLE that has been described in connection with FIG. 3. Each node controller also keeps track of the size of its free list, which is the difference between the (fixed) number of cells in the cell queue 210 of FIG. 2 and the contents of the register GLOBAL₋₋ COUNT 310 described in connection with FIG. 3. All of these quantities are available to be read at any time by the node monitor 200 shown in FIG. 2. In a similar way, each router keeps track of the input buffer length of each of its virtual circuits, in a table that is available to the router monitor 412 shown in FIG. 4. For purposes of disclosure, it will be assumed that each router manages its cell queue 406, shown on the left side of FIG. 4, in a manner similar to the switching nodes, so that quantities analogous to COUNT and GLOBAL₋₋ COUNT 310 are available to the router's monitor.

It is unnecessary, but desirable, for the node controllers and the routers to maintain smoothed averages of buffer lengths. A popular smoothing procedure for the time-varying quantity q is given by the easily implementable recursive algorithm,

    r.sub.n =(1-f)q.sub.n +fr.sub.n-1,

where q_(n) represents the value of q at epoch n, r_(n-1) represents the moving average at epoch n-1, r_(n) represents the moving average at epoch n, and f is a number between 0 and 1 that may be chosen to control the length of the averaging interval. If observations are made at intervals of Δt seconds, the approximate averaging interval is T_(AV) seconds, where

    T.sub.AV =(1-1/logf)Δt.

Appropriate averaging intervals for network congestion control may be between 10 and 100 round-trip times.

In various embodiments of the present invention, up to four binary quantities are used with each virtual circuit as indicators of network congestion. These quantities are defined as follows.

BIG₋₋ INPUT. A repetitive program at a router is executed periodically (FIG. 5, step 500) to update this parameter. It is set equal to 1 (step 508) for a virtual circuit if a buffer in a cell queue such as 406 for that virtual circuit at the router 110 has been occupied during more than a certain fraction of the time in the recent past, and it is set equal to 0 (step 510) if the buffer has not been occupied during more than that fraction of time. For the determination of BIG₋₋ INPUT, the quantity q in the moving-average algorithm (step 504) may be taken as 1 or 0 depending on whether or not any data is found in the buffer at the given observation. The quantity r (step 506) is then an estimate of the fraction of time that the buffer has been occupied during the past T_(AV) seconds. A representative but by no means exclusive threshold for r would be 0.5.

SOME₋₋ BACKLOG. This quantity is set equal to 1 for a given virtual circuit at a given node 114 or output router 120 if the virtual-circuit buffer at that node or router has been occupied during more than a certain fraction of the time in the recent past, and it is set equal to 0 otherwise. For the determination of SOME₋₋ BACKLOG, the quantity q in the moving-average algorithm may be taken as 1 or 0 depending on whether or not any data is found in the virtual-circuit buffer at the given observation. The quantity r is then an estimate of the fraction of time that the buffer has been occupied during the past T_(AV) seconds. The flow of control for the monitor program that calculates SOME₋₋ BACKLOG is entirely similar to FIG. 5. A representative but by no means exclusive threshold for r would be 0.5. The thresholds for BIG₋₋ INPUT and for SOME₋₋ BACKLOG need not be the same.

BIG₋₋ BACKLOG. This quantity is set equal to 1 for a given virtual circuit at a given node or output router if the virtual circuit has a large buffer length at the node or router, and is set equal to 0 otherwise. Since the lengths of buffers at bottleneck nodes vary slowly, smoothing of the buffer length is probably unnecessary. The criterion for a large buffer length may depend on the set of window sizes. If the window sizes are related by factors of 2, a representative although not exclusive choice would be to set BIG₋₋ BACKLOG equal to 1 if the instantaneous buffer length exceeds 75% of the current window, and equal to 0 otherwise. If the window sizes are equally spaced, a representative choice would be to set BIG₋₋ BACKLOG equal to 1 if the instantaneous buffer length exceeds 150% of the spacing between windows, and equal to 0 otherwise.

SPACE₋₋ CRUNCH. This quantity is set equal to 1 at a given node or output router if the instantaneous number of occupied cells, namely GLOBAL₋₋ COUNT 310, at that node or router is greater than some fraction F of the total number of cells in the cell queue 210 or 406 of FIG. 2 or FIG. 4, respectively, and it is set equal to 0 otherwise. A representative choice would be F=7/8, although the value of F does not appear to be critical.

Various window management protocols may be embodied using some or all of the congestion indicators defined above. Without limiting the scope of the invention, two embodiments are described below. In each of the two embodiments, each virtual circuit always has a buffer allocation at least as large as the minimum size B₀ and it may have other sizes variable up to the limit of a full size window W₀. The first embodiment makes use only of the length of a buffer at a data source (a router) and the availability of free queue space at the nodes to manage changes in window size. The second embodiment makes coordinated use of conditions relating to buffer lengths and free queue space at the data source and at all the nodes of the virtual circuit.

In each of the two embodiments, it is assumed that both directions of the virtual circuit traverse exactly the same nodes, and that each node has a single monitor 200 that can read and respond to messages carried by congestion control cells traveling in either direction. If the forward and return paths are logically disjoint, obvious modifications of the protocols can be used. Instead of carrying out some functions on the return trip of a control message, one can make another traverse of the virtual circuit so that all changes are effected by control messages traveling in the forward direction.

In the first embodiment, the flow of control in the program that runs in the monitor of the input router 110 is shown schematically in FIG. 6. In FIG. 6, the quantity LIMIT refers to the existing buffer allocation for a particular virtual circuit. The quantity WINDOW₋₋ SIZE refers to a proposed new buffer allocation. The input router 110 monitors the quantity BIG₋₋ INPUT for each of its virtual circuits (step 602 of FIG. 6). From time to time, as will be described below, it may request a change in the size of the window assigned to a given virtual circuit. It makes such a request by transmitting a control message over the virtual circuit (steps 608 and 614). In the embodiment described here, the message is carried by a special congestion control cell that is identified by a bit in its header. Alternatively, the congestion control message may be carried by special bits in a congestion field in the header of an ordinary data cell, if such a field has been provided. There is no logical difference between the use of special control cells and the use of header fields.

An input router that wishes to change the size of its window transmits a message containing the quantities 0, WINDOW₋₋ SIZE. The initial 0 represents a variable called ORIGIN. Messages that carry requests from input routers are distinguished by the value ORIGIN=0; messages that carry responses from output routers have ORIGIN=1, as will appear below. WINDOW₋₋ SIZE is the size of the requested window, coded into as many bits as are necessary to represent the total number of available window sizes. By way of example, if there are only two possible sizes, WINDOW₋₋ SIZE requires only a single 0 or 1 bit.

An input router that requests a new window size larger than its present window size (steps 612, 614) does not begin to use the new window size until it has received confirmation at step 616 (as described below. On the other hand, a router does not request a window size smaller than its current allocation until it has already begun to use the smaller window (step 606). Since switch nodes can always reduce buffer allocations that are above the initial window size, confirmation of a request for a smaller window is assured.

When the node controller 212 of a switching node along the forward path receives a control message containing 0, WINDOW₋₋ SIZE, it processes the message as follows. If the node controller can make the requested buffer allocation it does so, and passes the message to the next node without change. If there is insufficient unallocated space in the free list to meet the request, the node allocates as large a buffer size as it can, the minimum being the current buffer size. In either case, the controller writes the value of WINDOW₋₋ SIZE that it can allow into the message before passing it along to the next node. The output router also meets the requested value of WINDOW₋₋ SIZE as nearly as it can, sets ORIGIN=1 to indicate a response message, and transmits the response containing the final value of WINDOW₋₋ SIZE to the first switching node on the return path. Node controllers on the return path read ORIGIN=1 and the WINDOW₋₋ SIZE field and adjust their allocations accordingly. The adjustments involve, at most, downward allocations for nodes that met the original request before some node failed to do so. When the input router receives a control message containing 1, WINDOW₋₋ SIZE, it knows that a set of buffer allocations consistent with the value WINDOW₋₋ SIZE exist along the whole path.

A newly opened virtual circuit has a buffer allocation B₀ at each node and has a window of size B₀. The input router should request an increase in window size as soon as it observes that BIG₋₋ INPUT=1. After requesting a window change and receiving a response, the input router may wait for some period of time D, such as 10 to 100 round-trip times, before inspecting BIG₋₋ INPUT again. Then if BIG₋₋ INPUT=1, it may ask for another increase in window size, or if BIG₋₋ INPUT=0, it may ask for a decrease. If a decrease is called for, the input router does not issue the request until the amount of outstanding data on the virtual circuit will fit into the smaller window, and from that time on it observes the new window restriction. The actual allocation is not changed until the value of LIMIT is set equal to the value of WINDOW₋₋ SIZE (steps 608, 618).

The flow of control in the program that runs in the monitor of a switching node 114, in response to the arrival of a congestion control cell from either direction, is depicted in FIG. 7. Step 700 changes LIMIT to match the requested window size as closely as possible. Step 702 writes the new value of LIMIT into the control cell and passes the message along to the next node in the virtual circuit.

The previous embodiment has made use only of congestion information at the input router. A second embodiment employs a protocol that coordinates congestion information across the entire circuit in order to pick a new window size if one is needed. It uses a two-phase signaling procedure, in which the first phase sets up the new window and the second phase resolves any discrepancies that may exist among the new window and the buffer allocations at the various nodes. The logical steps carried out by the input and output routers and by the switching nodes are illustrated schematically in FIG. 8 through 12.

The protocol for the second embodiment uses the quantities ORIGIN, BIG₋₋ INPUT, SOME₋₋ BACKLOG, BIG₋₋ BACKLOG, and SPACE₋₋ CRUNCH that were defined earlier. Since the protocol uses two phases of signaling, it requires one extra binary quantity, PHASE, which takes the value 0 for Phase 1 and 1 for Phase 2. In Phase 1, the input router 110 initiates a control message carrying a 6-bit field that consists of the quantities ORIGIN=0, PHASE=0, BIG₋₋ INPUT, SPACE₋₋ CRUNCH=0, SOME₋₋ BACKLOG=0, BIG₋₋ BACKLOG=0. The flow of control for the input router is depicted in FIG. 8.

The flow of control for a node controller is shown in FIG. 9. When a node controller receives a Phase 1 control message, it inspects the values of SPACE₋₋ CRUNCH (step 900), SOME₋₋ BACKLOG (step 904), and BIG₋₋ BACKLOG (step 910), and if its own value of the given quantity is 0, it passes that field unchanged. If its own value of the quantity is 1, it writes 1 into the corresponding field, as shown in FIG. 9 (steps 902, 906, 910), before transmitting the control message to the next switching node (step 912).

When the receiving router 120 receives a Phase 1 control message, it first combines its own values of SPACE₋₋ CRUNCH, SOME₋₋ BACKLOG, and BIG₋₋ BACKLOG with the values in the arriving message, just as the switching nodes have done. The receiving router then inspects the last four bits of the modified message and calculates a proposed value of WINDOW₋₋ SIZE according to the four cases below, using the logic flow shown in FIG. 10.

1) If BIG₋₋ INPUT=1 and SOME₋₋ BACKLOG=0 (step 1000), then increase the window size.

The virtual circuit is nowhere bottlenecked by the round robin scheduler and the virtual circuit would like to send at a faster rate; it is being unnecessarily throttled by its window.

2) If BIG₋₋ BACKLOG=1 and SPACE₋₋ CRUNCH=1 (steps 1002, 1004), then reduce the window size.

Some node is bottlenecked by the round robin scheduler and a big buffer has built up there, so the window is unnecessarily big; and some node is running out of space.

3) If BIG₋₋ INPUT=0 and SOME₋₋ BACKLOG=0 and SPACE₋₋ CRUNCH=1 (step 1006), then reduce the window size.

The virtual circuit has a light offered load, so it does not need a big window to carry the load; and some node is running out of space.

4) In all other cases (step 1008), the present window size is appropriate.

The receiving router then transmits the Phase 1 control message to the first switching node on the return path (step 1012). The response message contains the fields ORIGIN=1, PHASE=0, WINDOW₋₋ SIZE, where the last field is a binary encoding of the recommended window size. Each node controller 212 on the return path looks at the control message and takes the action shown in FIG. 11. If an increased allocation is requested (step 1100), the node makes the allocation if it can (step 1102). If it cannot make the requested allocation, it makes whatever allocation it can make, the minimum being the present buffer size, and writes the allocation it has made into the WINDOW₋₋ SIZE field (step 1104). The node then transmits the control message to the next node on the return path (step 1106). If the request is for a decreased allocation, the node does not make the decrease yet, but it passes the WINDOW₋₋ SIZE field along unchanged.

When the transmitting router receives the Phase 1 response message (step 804), the WINDOW₋₋ SIZE field indicates the window that the virtual circuit is going to have. If there is an increase over the present window size, it is available immediately. If there is a decrease, the transmitting router waits for the amount of unacknowledged data in the virtual circuit to drain down to the new window size, as shown in FIG. 8 at step 806. Then it transmits a Phase 2 control message with the fields ORIGIN=0, PHASE=1, WINDOW₋₋ SIZE (step 810). Node controllers receiving this message take the action shown in FIG. 12. They adjust their buffer allocations downward, if necessary, to the value of WINDOW₋₋ SIZE (step 1200), and pass the control message along unchanged (step 1202). The receiving router returns a Phase 2 response message with the fields ORIGIN=1, PHASE=1, WINDOW₋₋ SIZE. The switching nodes simply pass this message along, since its only purpose is to notify the transmitting router that a consistent set of buffer allocations exists along the entire virtual circuit.

After completing Phase 2, the transmitting router waits for a while, as shown at step 816 in FIG. 8, before beginning Phase 1 again. First it waits until either a window's worth of data has been transmitted since the end of Phase 2 or a certain period of time D, such as 10 to 100 round-trip times, has elapsed since the end of Phase 2, whichever comes first. Then, if the present window size is greater than the minimum window size B₀ (step 818) or if BIG₋₋ INPUT=1 (step 800), Phase 1 begins immediately; otherwise, Phase 1 begins as soon as BIG₋₋ INPUT=1. A newly opened virtual circuit, whose initial window size and buffer allocations are B₀, should begin Phase 1 as soon as BIG₋₋ INPUT=1, if ever.

Overview of Window Sizing: FIG. 1 and 2

Further work since the filing of the parent of the present application has resulted improved methods for sizing windows in cell network 100 of FIG. 1. The methods are particularly adapted for use with the first embodiment disclosed in the parent. The following discussion first presents an overview of these methods and then provides detailed discussions of techniques for determining the ideal window size for a virtual circuit, techniques for determining when a resizing is necessary, and techniques for performing the resizing.

In network 100, each switching node 114 has a memory buffer 210 (FIG. 2). The buffer is logically divided into a per-circuit queue for each virtual circuit, together with some unassigned memory space. The per-circuit queues contain cells being sent via the virtual circuit to which the queue belongs. The queues are served round robin. The amount of buffer space assigned to each virtual circuit's queue may vary from time to time but is never less than the circuit's current window size. Switching controller 212 maintains a list of the amount of memory allocated to each virtual circuit. If a virtual circuit's queue overflows, cells belonging to that virtual circuit only are discarded. However, if the per-circuit queues are sized according to the present invention, overflows will only occur at router 110, and never within the network.

The routers 110 and 120, which are assumed to belong to the network vendor, enforce edge-to-edge cell windows on the virtual-circuit network. Each virtual circuit is given a default window when it is set up. The default window is at a minimum large enough to hold the largest packet which will be transmitted via the virtual circuit and at least some signalling information. The virtual circuit retains a window of at least the size of the default window for as long as it exits. Input router 110 can issue requests for increases in window size up to a full round-trip window, or decreases down to the default window. Increases may be requested at intervals as short as one round-trip time; decreases are requested at longer intervals determined by a renegotiation timer in router 110. A request travels around the virtual circuit and the node monitors 200 confirm or modify it as described below and also make appropriate changes in buffer allocation. When the response returns to input router 110, router 110 knows that cell buffer allocations corresponding to a new window for the virtual circuit exist in all switching nodes 114 in the virtual circuit. Router 110 begins to use a larger window after the increased buffer allocations are confirmed. It begins to enforce a smaller window before requesting a decrease in buffer allocations.

Determining the Ideal Window Size for a Virtual Circuit

In the following, an algorithm is developed for determining the ideal window size for a virtual circuit. The development of the algorithm begins with a simplified case in which circuits are turned on one at a time and transmit continuously after they are turned on, then modifies the simple case to take into account intermittent transmission of data by a virtual circuit.

A single user (virtual circuit) which encounters no contention on any link through which it passes needs a window of size W₀ in order to use the full network bandwidth. A user who shares a link with other active users does not need a window as large as W₀, because such a user is not entitled to the entire bandwidth. In principle, if N users transmit continuously via a link, each of them needs a window no larger than W₀ /N, and the total window requirement is just W₀.

As a slightly more realistic example, consider the hypothetical case in which circuits transmitting via a link are turned on one at a time and transmit continuously. If we assign a window of size W₀ /k to the kth circuit to be turned on, then when k circuits are transmitting, the round robin queueing discipline gives each one a fraction 1/k of the trunk bandwidth, and nobody's throughput is unnecessarily window-limited. If the kth user gets a window of size W₀ /k, the total buffer space B for N users satisfies ##EQU1## so that in practice B would be a few times W₀.

In general, data networks will have many types of users, who may be classified into three broad categories: 1) Interactive users, whose transmissions are shorter than the default window; 2) bulk users, whose transmissions are long compared to W₀ and are separated by intervals long compared to the round-trip propagation time T₀ ; and 3) intermittent users, who exhibit periods of activity marked by repeated transmissions comparable to W₀ at intervals comparable to T₀, separated by periods of inactivity long compared to T₀. Intermittent users are the hardest to provide for efficiently, and it is this class of users that we consider in choosing window sizes.

The model that led to Eq. (1) is unrealistic in that it assumes that the number of users who are actively transmitting when a new user arrives is equal to the number of users who are holding window allocations as large as or larger than the new user. On the average, the number of actively transmitting users is somewhat smaller, because users do not transmit during some part of the time that they hold a window allocation. We model the effect of idle time as follows.

Assuming that the number of users with window allocations varies slowly, we consider a closed queueing network with two nodes, "active" and "idle". Transmitting users are considered to be queued at the active node, which has a single processor-sharing server. The average service-time requirement of an intermittent user on each pass through the active node is τ. After each burst of activity, the user visits the idle state, modeled as an infinite-server node, for an average time hτ. In the actual network, a user that has been idle for longer than about hτ would be judged quiescent and have its window reduced to the default window, but this population loss is not included in our closed network model.

We can apply mean-value analysis as described in E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik, Quantitative System Performance: Computer System Analysis Using Queueing Network Models, Prentice-Hall (1984), pp. 112-116, to determine J_(k), the average number of active users in a network with k users. The average time for a user to remain active is (J_(k-1) +1)τ, out of an average cycle time of (J_(k-1) +1)τ+hτ; hence ##EQU2## It is trivial to evaluate J_(k-1) numerically from the recurrence (2) for any value of h, starting from J₀ =0. However, a remarkably accurate closed-form expression for J_(k-1) over the parameter ranges of interest can be obtained by replacing the right side of (2) by J_(k-1) /(k-1) and solving the resulting quadratic equation.

This closed-network analysis can be used to size windows for the real network as follows. Suppose that the kth arriving user receives a window allocation W_(k-1) when k-1 intermittent users are already present with windows greater than or equal to W_(k-1). The convention of denoting the kth user's window by W_(k-1) permits us to denote the first user's window by the symbol W₀ that we have used for the full round-trip window. In order that the kth user's throughout not be unnecessarily restricted, W_(k-1) needs to satisfy

    W.sub.k-1 /W.sub.0 =1/(J.sub.k-1 +1).

Using the closed-form approximation to J_(k-1) yields ##EQU3##

If h=0, Eq. (4) gives W_(k-1) /W₀ =1/k, as it should. If h>0, we have

    W.sub.k-1 /W.sub.0 ≈1-(k-1)/h

for k<<h,

so that the window sizes given to the first few users decrease linearly from W₀. Near k=h there is a transition. The hth user gets a window

    W.sub.k-1 /W.sub.0 ≈1/h.sup.1/2

for k=h,

and the tail of the window-size distribution is

    W.sub.k-1 /W.sub.0 ≈1/(k-h)

for k>>h,

which is a shifted version of (1).

If the kth user is given an allocation according to (4), the total buffer allocation for N users satisfies ##EQU4## The sum may be approximated by an integral, giving ##EQU5## where x₁ =1/2-h, x₂ =x₁ +N, and r₁,2 =(x₁,2² +4h)^(1/2). A little algebra shows that

    B/W.sub.0 ≈log N+h/2

for N>>h>>1. Tradeoffs among B/W₀, N, and h can be calculated using this equation.

What are realistic values of h? Presumably the intermittent users will have message lengths no shorter than about one round-trip window, because if they had much shorter messages they would not have been allocated maximal windows in the first place. A virtual circuit's window can be shut down in about one round-trip time, so in principle h could be near unity. However one may wish to allow intermittent users a few seconds of think time before the network decides that they are quiescent. A transcontinental round trip is about 60 ms. An idle time of 3 s per round-trip window of transmitted data corresponds to h=50; an idle time of 6 s corresponds to h=100.

If a constant default window is assigned to every circuit beyond a certain point, at that point the curves of total buffer usage become linear. Suppose that the first K users are given windows computed as above, and the remaining N-K users are given windows of size Δ. Then the total buffer space required by N users is ##EQU6## The right-hand side of (5) increases with K so long as

    W.sub.K-1 ≧Δ.

In practice one would choose the largest value of K, say K₂, for which (8) is satisfied. If the total buffer space calculated by setting K=K₂ turns out to be greater than the maximum amount of memory, say B_(m), than one wishes to provide at each switch, then one would choose the largest value of K, say K₁, for which B≦B_(m). If K₁ <K₂, then under some conditions when there are between K₁ and K₂ intermittent users the trunk may not be fully utilized, although the users desire to do so. Of course, one cannot even provide default windows to N users unless B_(m) ≧NΔ.

Discrete Ideal Window Sizes

Suppose that there are M different discrete window sizes. Suppose that the maximum number of virtual circuits that can exist simultaneously is N. We wish to choose a set of break points, say 0=N_(0<N) ₁ < . . . <N_(M) =N. We also wish to choose a set of window sizes, say W₀ >W₁ > . . . >W_(M-1), and assign them to circuits in the following way. A circuit that becomes active is given the smallest window W_(i) such that N_(i) <k≦N_(i+1), where k-1 is the number of other circuits with windows of size W_(i) or greater.

For any particular choice of N_(i) we can get the minimum value of W_(i) that does not restrict the bandwidth of the (N_(i) +1)st circuit by solving (2) recursively for J_(N).sbsb.i and then calculating W_(i) from

    W.sub.i /W.sub.0 =1/(J.sub.N.sbsb.i +1).

However, it is much easier to use the closed-form approximation described in the preceding section. According to this approximation, the normalized window w_(i) =W_(i) /W₀ satisfies the quadratic equation

    hw.sub.i.sup.2 +(N.sub.i +1-h)w.sub.i -1=0,

whose solution is ##EQU7##

For any given set of break points and window sizes, the normalized total buffer usage b=B/W₀ is ##EQU8## We wish to minimize b with respect to the M-1 disposable break points, or alternatively with respect to the M-1 disposable window sizes. Differentiating the right side of (11) with respect to each w_(i) in turn, and noting that N_(i) depends only on w_(i), we obtain

    (w.sub.k-1 -w.sub.k)dN.sub.k /dw.sub.k +N.sub.k+1 -N.sub.k =0,

for k=1,2, . . . , M-1. In addition, we have by differentiating Eq. (11), ##EQU9##

The case h=0 is particularly simple. If there are M different window sizes, it is an elementary exercise to show that the total buffer space B used by N virtual circuits is minimized if the values of N₁ +1, N₂ +1, . . . , are chosen as the M-1 geometric means between 1 and N+1. Thus

    N.sub.i +1=(N+1).sup.i/M,

i=0, 1, . . . , M,

and the minimum value of buffer space satisfies

    B/W.sub.0 =M[(N+1).sup.1/M -1].

In Eq. (17), it can be shown that if N is large and if we choose the number of window sizes M equal to the number of users N, the right side of (17) is approximately log N.

If h is not zero, (14) is a system of M-1 equations that can be solved numerically. The simplest way is to observe that N₂, . . . , N_(M-1) can be calculated successively from an arbitrary starting value of N₁, so that the whole system reduces to

    f(N.sub.1)=N,

where N is the maximum number of virtual circuits. The value of N₁ that satisfies (18) can be determined as accurately as desired by a root-finding technique such as the method of bisection.

Changing Cell Buffer Sizes: FIG. 13

As already explained, requests for changes in cell buffer sizes for a virtual circuit are initiated by input router 110. The request takes the form of congestion control information. The information may either be incorporated into the header of each cell sent via the virtual circuit, or may be included in a separate congestion control cell. FIG. 13 shows congestion control information 1301 in a preferred embodiment. Field RR 1303 is a request-response bit; field SN 1305 is a sequence bit; the remaining bits make up window size field 1307, which indicates a cell buffer size in nodes 114.

In the preferred embodiment, congestion control information 1301 is part of the cell header and the fields are employed as follows: to make a request to change the size of the cell buffers in nodes 114 for a virtual circuit, router 110 sets congestion control information 1301 in each outgoing cell belonging to the virtual circuit so that RR 1303 indicates a request, field SN 1305 has a sequence number other than that of the last request to change size, and field 1307 contains the desired window size. If the request is for a reduction in window size, router 110 first reduces the flow of cells to the virtual circuit to a rate compatible with the new window size and then requests the reduction; if the request is for an increase in window size, router 110 does not increase the flow of cells until it has received congestion control information 1301 from router 120 indicating the size to which the window can be increased.

The memory for each node 114 includes for each virtual circuit passing through the node a copy of the congestion control information which was last used to adjust the size of the virtual circuit's window. In the following, this is termed the current congestion control information for the node. Whenever a cell belonging to a given virtual circuit passes through node 114, controller 212 copies the current congestion control information into the cell's header.

When a node 114 receives a cell, congestion control information 1301 is stripped out of the cell and provided to monitor 200. If the congestion control information 1301 has an RR field 1303 which indicates a request and a SN field 1305 which is different from that in the current congestion control information, monitor 200 determines to what extent it can provide a window of the size specified in window size field 1307. Having done so, it sets the current congestion control information to the values of RR and SN in the incoming request and the value of WS 1307 to the value which it determined. From that time on, the headers of all cells for the virtual circuit leaving node 414 will have copies of the new current congestion control information.

Determination of the window size is as follows: If the size specified for the virtual circuit in the request is smaller than the present window, monitor 200 simply copies the request into the current congestion control information for the virtual circuit. If the size specified is larger than the present window and the node 114 can provide a cell buffer of the specified size, monitor 200 again simply copies the request into the current congestion control information for the virtual circuit. If the size specified is larger but node 114 cannot provide a window of the size indicated in window size field 1307, monitor 200 determines the size of the window it can provide and copies the request into the current congestion control information in controller 212, but changes window size 1307 to indicate the size of window which it can provide. The method by which node 114 determines the size of window it can provide will be explained in more detail below.

As is apparent from the foregoing, when a cell with congestion control information 1301 for the request by router 110 reaches router 120, window size 1307 will indicate the smallest window size which any of the nodes 114 can provide. Router 120 then determines whether the availability of buffer space in router 120 requires a further reduction in window size. After determining the window size, router 120 sets congestion control fields 1301 in cells which it is sending via the virtual circuit as follows: RR 1307 is set to indicate a response; SN 1305 remains the same, and WS 1307 is set either to the smallest window size specified by any of nodes 114 or to the still smaller window size required by router 120. When each node 114 receives the response message, it sets the cell buffer size for the virtual circuit as specified in window size field 1307, copies the response message into the current congestion control information, and begins copying the new current control information into cells of the virtual circuit destined for router 110. When router 110 receives a cell for the virtual circuit whose header contains the response message, it knows that cell buffers of the size specified in window size field 1307 are available for the virtual circuit in all of the nodes and increases the flow of cells to the virtual circuit accordingly. The next request by router 110 for a change in window size is made in the same fashion, except that SN 1305 is set to a value different from that of the last request. As is clear from the foregoing, router 110 must wait at least until it has received a response from router 120 before it can again request an adjustment in window size.

If there are too many window sizes to be coded into the available header space, then congestion control information can be carried as a data field in special congestion control cells each marked by a single bit in its header.

Determining When to Request a Change in Cell Buffer Size

While transmitting router 110 may request an increase in window size at any time after the response to the previous request has been received, in a preferred embodiment, requests to decrease window size are separated by a renegotiation interval. A renegotiation interval is roughly hτ, where τ is the longest round-trip time in the network and h is the idle-time parameter previously discussed. As previously indicated, realistic values of h are values such that hτ is a small number of seconds.

To determine the size of the next window request, router 110 keeps track of the total number of cells that the given virtual circuit has in the system, that is, the number of cells router 110 has waiting to be transmitted via the virtual circuit plus the number of cells in nodes 114 for the virtual circuit. The latter number can be estimated by keeping track of the difference between the number of cells sent and the number of cells which have been acknowledged. Router 110 also keeps track of the cumulative throughput of the virtual circuit during the last renegotiation interval. When router 110 requests a window, the size to be requested is determined from the default window size which was set for the virtual circuit when the virtual circuit was established, the total number of cells that the virtual circuit has in the system, and the number of cells which would have passed through the circuit during one round-trip time if the circuit had operated during the round-trip time at a rate corresponding to its average throughput during the renegotiation interval. The latter value, TN, is derived from the expression ##EQU10## where CT is the cumulative throughput, T₀ is the round-trip time, and T_(reneg) is the renegotiation interval. The size of the request is determined from the largest of the default window size, the total number of cells in the system, and TN, up to the full round-trip window. TN is included in the above computation to prevent router 110 from closing down a virtual circuit's window because of momentary idleness.

If router 110 cannot accommodate a full round-trip window of data in the input packet buffer of each virtual circuit that it supports, router 110 should provide an input buffer at least as large as the current cell window for the virtual circuit, and it should keep track of input buffer overflows. An input overflow since the last request for an increase in cell-window size can be treated as if the circuit had a full round-trip's worth of data in the system at the time the next request for an increase in window size goes out.

Determining Cell Buffer Sizes in Nodes 114: FIG. 14

If the ideal window sizes for the windows W₀ through W_(k-1) which result when the window sizes are derived using Eq. 3 or 4 above, are plotted against the circuit numbers 1 . . . k, the result is a curve which appears in FIG. 14 as curve 1405. Each monitor 200 has a table in which the size of the ideal window for each potential virtual circuit 1 . . . k as determined by curve 1405 is associated with the potential virtual circuit's number. Monitor 200 further keeps track of the current cell buffer allocated to each virtual circuit in the node and the rank of each of those virtual circuits, where the rank is the ordinal number of that circuit's cell buffer allocation. The circuit with the largest allocation has rank 1, the next largest has rank 2, and so on. Thus, if W_(c) represents the current allocation of the circuit whose rank is k, then W_(c) must be less than or equal to W_(k-1).

When a request is made to increase the size of the virtual circuit's window to a requested size W_(r), the table, the size of the current window, and the rank of the virtual circuit are employed as follows to determine the size of the virtual circuit's new window: When congestion control information 1301 arrives which requests enlargement of the cell buffer for a given virtual circuit, monitor 200 first determines what rank the given virtual circuit would have relative to the other virtual circuits if it were given the window size W_(r) specified in WS field 1307. This is the given virtual circuit's hypothetical rank. Beginning at the current rank of the given virtual circuit, monitor 200 then exchanges rank with each next-higher ranked virtual circuit until the given virtual circuit either attains the hypothetical rank or until the exchange would require giving the next higher virtual circuit a rank which was inconsistent with the present cell buffer size for the next higher virtual circuit. Inconsistency is determined using the table: the new rank for the next higher circuit is used as one of the numbers 1 . . . k in the table, and if the cell buffer size specified for that number is less than the present cell buffer size for the next higher virtual circuit, the rank to which the next higher virtual circuit would be demoted is inconsistent.

Let j be the rank which the given circuit has at the end of the series of interchanges of rank. The circuit then receives an actual allocation equal to min(W_(r), W_(j-1)), and the final ranks are consistent with the final allocations. If a decreased allocation is requested, the decreased is given automatically and the circuit's rank is exchanged with circuits having lower ranks until consistency is achieved. Once monitor 200 has determined the new buffer allocation, it sets the current congestion control information as described above, and the next node 114 responds to the congestion control information in the headers of cells for the virtual circuit which have passed through this node 114 in the manner just described.

FIG. 14 shows an example of an increase. In the figure, each vertical line 1407 A . . . D represents a virtual circuit. The length of the line represents the virtual circuit's present window size. In panel 1401, circuits A, B, C, and D are in rank order and the cell buffer size for each of the virtual circuits 1407 is consistent with the circuit's position with regard to curve 1405. Then monitor 200 receives congestion control information 1301 for virtual circuit D which requests a full round trip window W₀ for the virtual circuit, as shown by the dotted line labelled 1409. As shown by the fact that line 1409 extends above curve 1405, the window size thus requested is larger than curve 1405 permits for a virtual circuit which has rank 4. Virtual circuit D is consequently first exchanged with virtual circuit C and then with virtual circuit B. In neither case does the demotion of the exchanged virtual circuit cause the line representing the size of the demoted virtual circuit's cell buffer to intersect curve 1405, i.e., the new rank is consistent with the demoted virtual circuit's current cell buffer size. However, when the exchange with virtual circuit A is attempted, the demotion of virtual circuit A results in an inconsistency. Consequently, virtual circuit D is given rank 2 and its cell buffer size is set to the maximum which curve 1405 permits for that rank. The result is shown in panel 1403. Circuit D's new cell buffer size gives it a fair share of bandwidth in competition with other circuits. While curve 1405 results in a particularly advantageous and efficient allocation of cell buffers in the nodes, the method just described may be employed with any other curve where the window for a virtual circuit i+1 is smaller than that for virtual circuit i, 1≦i<k

Conclusion

The foregoing Detailed Description has disclosed how one of ordinary skill in the art may control congestion in a virtual circuit network in which data is transmitted in cells. In particular, the Detailed Description has disclosed improved techniques for selecting the window size for a cell buffer for a virtual circuit in a node of the netork, improved techniques for determining when a virtual circuit requires a change in cell buffer size, and improved techniques for determining how a node should respond to a request to change the cell buffer size for a virtual circuit. The Detailed Description has further disclosed the best modes presently known to the inventors for implementing the inventions which were first disclosed in this application. However, as is clear from the Detailed Description, and as is apparent to those of ordinary skill in the art, the invention may be implemented in other fashions without departing from the spirit and principles of the present invention. For example, other implementations may employ other systems for signalling a change of cell buffer size, may give the congestion control information different forms, and curves other than curve 1405 may be employed to govern selection of buffer size in a node. Consequently, the Detailed Description is to be considered in all respects as being illustrative and exemplary, but not restrictive, and the scope of the invention is not to be determined from the Detailed Description, but rather from the claims as read in light of the Detailed Description and interpreted according to the Doctrine of Equivalents. 

What is claimed is:
 1. In a virtual circuit data network having one or more nodes, a method of adjusting the size of a window W_(k-1) in the node for the kth virtual circuit using a given link from the node, the method comprising the steps of:determining the average number of active virtual circuits J_(k-1) using the link prior to the addition of the kth virtual circuit; and adjusting the size of the window W_(k-1) for the kth virtual circuit from the equation ##EQU11## where W₀ is a full-speed round trip window.
 2. The method set forth in claim 1 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(k-1) is performed using the recurrence ##EQU12## starting from J₀ =0.
 3. The method set forth in claim 1 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(k-1) is performed using the approximation ##EQU13## for J_(k-1).
 4. The method set forth in claim 3 wherein:the step of determining the average number of active virtual circuits is performed using the longest round trip time of the network as τ and a value of h such that hτ is a small number of seconds.
 5. In a virtual circuit data network having one or more nodes, a method of adjusting the size of a window W_(k-1) in the node for the kth virtual circuit using a given link from the node, the method comprising the steps of:determining that there is to be a fixed number M of window sizes; dividing the number N of virtual circuits which can exist simultaneously in the network into a set of M+1 break points such that 0=N₀ <N₁ < . . . <N_(M) =N; associating M window sizes W₀ >W₁ > . . . >W_(M-1) with the break points N₀ through N_(M-1) such that N_(i) is associated with W_(i) ; determining the average number of active virtual circuits J_(Ni) using the link prior to the addition of the kth virtual circuit; and adjusting the size of the window W_(i) associated with virtual circuit N_(i) from the equation ##EQU14## where N_(i) <k≦N_(i+1) and W₀ is a full-speed round trip window.
 6. The method set forth in claim 5 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(Ni) is performed using the recurrence ##EQU15## starting from J₀ =0 and retaining the result only for each J_(Ni).
 7. The method set forth in claim 5 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(Ni) is performed using the approximation ##EQU16## for J_(Ni).
 8. The method set forth in claim 7 wherein:the step of determining the average number of active virtual circuits is performed using the longest round trip time of the network as τ and a value of h such that hτ is a small number of seconds.
 9. The method set forth in claim 8 wherein:the normalized total buffer usage b is minimized by solving the system of equations for k=1, 2, . . . , M-1

    (W.sub.k-1 -W.sub.k)dN.sub.k /dw.sub.k +N.sub.k+1 -N.sub.k =0, ##EQU17##


10. A method employed at an edge of a virtual circuit data network in which data is transported in cells to determine the size of the window to be requested in the network for a given virtual circuit originating at the edge, the method comprising the steps of:keeping track of the total number of cells TC that the given virtual circuit has at the edge and in the network; keeping track of the cumulative throughput CT of cells of the given virtual circuit during a most recent renegotiation interval; and requesting a window for the virtual circuit in the network which is large enough to accommodate a number of cells which is the larger of TC and the product of CT times the quotient of the round-trip time divided by the length of the most recent renegotiation interval.
 11. The method set forth in claim 10 further including the step of:keeping track of whether a cell buffer for the given virtual circuit at the edge overflows; and if the cell buffer overflows during the renegotiation interval, requesting a round-trip window in the step of requesting a window.
 12. The method set forth in claim 10 wherein:when the requested window is larger than the current window, the step of requesting a window may be performed at any time at which there is no pending request for a window; and when the requested window is smaller than the current window, the step of requesting a window may not be performed until the end of the current renegotiation interval.
 13. The method set forth in any of claims 10 through 12 wherein:the renegotiation interval is a small number of seconds.
 14. A method employed in a node of a virtual circuit network for sizing a window in the node for a given one of k virtual circuits using a given link from the node in response to a request for a different-sized window in the node, the method comprising the steps of:determining the maximum window to which each of the k virtual circuits is entitled according to a function whereby the maximum window for a virtual circuit j is greater than the maximum window for a virtual circuit j+1, 1≦j≦k; determining the window for each virtual circuit in the node and the rank of each virtual circuit with regard to the current size of its window; determining a potential rank which the given virtual circuit would have if its window were the requested size; and changing the rank of the given virtual circuit in the direction required by the potential rank by exchanging its rank with that of the next ranking virtual circuit in the required direction until the given virtual circuit either attains the potential rank or until further changing the rank of the given virtual circuit would require changing the rank of the next ranking virtual circuit to a rank such that the current size of the window of the next ranked virtual circuit is greater than the maximum window for the rank which the next ranked virtual circuit would receive as a result of the exchange; and sizing the window for the given virtual circuit such that the window's size is the lesser of the size of the requested window and the size of the maximum window for the final rank attained by the given virtual circuit.
 15. The method set forth in claim 14 wherein:the step of determining the maximum window W_(i-1) to which a given virtual circuit i is entitled includes the steps of: determining the average number of active virtual circuits J_(i-1) using the link from the node; and determining the maximum window W_(i-1) using the equation ##EQU18## , where W₀ is a full-speed round-trip window.
 16. The method set forth in claim 15 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(i-1) is performed using the recurrence ##EQU19## starting from J₀ =0.
 17. The method set forth in claim 15 whereina virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(i-1) is performed using the approximation ##EQU20## for J_(i-1).
 18. The method set forth in claim 16 or claim 17 wherein:the step of determining the maximum window size is performed using the longest round trip time of the network as τ and a value of h such that hτ is a small number of seconds.
 19. A method of controlling the congestion of data cells in nodes of a network for carrying cells of data via virtual circuits, the method comprising the steps of:when a virtual circuit is established, assigning a default cell buffer for the virtual circuit at each node; for the duration of the virtual circuit, performing steps including determining from the behavior of the virtual circuit whether a different-sized cell buffer is needed; if a different-sized cell buffer is needed, providing a first resizing signal indicating the different size to the nodes in the virtual circuit; in each node of the virtual circuit, responding to the first resizing signal by indicating the buffer size which the node can provide if that is less than the different size; and in each node of the virtual circuit, setting the cell buffer for the virtual circuit to a buffer size which is no greater than the smallest buffer size indicated by any of the nodes.
 20. The method set forth in claim 19 wherein:the step of determining whether a different-sized cell buffer is needed is performed at a first edge of the network at which the virtual circuit enters the network; and the method includes the further step of receiving the first resizing signal at a second edge of the network at which the virtual circuit leaves the network and selecting the buffer size to which the cell buffers in the nodes are to be set.
 21. The method set forth in claim 20 wherein:the method includes the further step of providing a second resizing signal containing the selected buffer size from the second edge to the nodes; and the step of setting the cell buffer for the virtual circuit is performed using the selected buffer size specified in the second resizing signal.
 22. The method set forth in claim 21 wherein:the step of providing the first resizing signal is performed by serially providing the first resizing signal to every node in turn.
 23. The method set forth in claim 22 wherein:the step of providing the second resizing signal is performed by serially providing the second resizing signal to every node in turn.
 24. The method set forth in claim 20 wherein:the step of determining whether a different-sized cell buffer is needed is performed by doing steps including: keeping track of the total number of cells TC that the given virtual circuit has at the first edge and in the network; keeping track of the cumulative throughput CT of cells of the given virtual circuit during a most recent renegotiation interval; and requesting a window for the virtual circuit in the network which is large enough to accommodate a number of cells which is the larger of TC and the product of CT times the quotient of the round-trip time divided by the length of the most recent renegotiation.
 25. The method set forth in claim 24 further including the step of:keeping track of whether a cell buffer for the given virtual circuit at the first edge overflows; and if the cell buffer overflows during the renegotiation interval, requesting a round-trip window in the step of requesting a window.
 26. The method set forth in claim 24 wherein:when the requested window is larger than the current window, the step of requesting a window may be performed at any time at which there is no pending request for a window; and when the requested window is smaller than the current window, the step of requesting a window may not be performed until the end of the current renegotiation interval.
 27. The method set forth in claim 26 wherein:the renegotiation interval is a small number of seconds.
 28. The method of claim 19 wherein the step of responding to the first resizing signal includes the steps of:determining the rank of each virtual circuit relative to the other virtual circuits from the current size of each virtual circuit's window; determining a potential rank which the given virtual circuit would have if its window were the requested size; changing the rank of the given virtual circuit in the direction required by the potential rank by exchanging its rank with that of the next ranking virtual circuit in the required direction until the given virtual circuit either attains the potential rank or until further changing the rank of the given virtual circuit would require changing the rank of the next ranking virtual circuit to a rank such that the current size of the window of the next ranked virtual circuit is greater than the maximum window for the rank which the next ranked virtual circuit would receive as a result of the exchange, the maximum window for a rank being determined according to a function whereby the maximum window for a virtual circuit j is greater than the maximum window for a virtual circuit j+1, 1≦j≦k; and sizing the window for the given virtual circuit such that the window's size is the lesser of the size of the requested window and the size of the maximum window for the final rank attained by the given virtual circuit.
 29. The method set forth in claim 28 wherein:the maximum window W_(i-1) to which a given virtual circuit i is entitled is determined by steps including: determining the average number of active virtual circuits J_(k-1) using the link from the node; and determining the maximum window W_(i-1) using the equation ##EQU21## , where W₀ is a full-speed round-trip window.
 30. The method set forth in claim 29 wherein:a virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(i-1) is performed using the recurrence ##EQU22## starting from J₀ =0.
 31. The method set forth in claim 29 whereina virtual circuit in intermittent use has an average service time requirement τ in which it is in active use and an average idle time of hτ and the step of determining the average number of active virtual circuits J_(i-1) is performed using the approximation ##EQU23## for J_(i-1).
 32. The method set forth in claim 30 or claim 31 wherein:the step of determining the maximum window size is performed using the longest round trip time of the network as τ and a value of h such that hτ is a small number of seconds. 